Enhanced Security for Dynamic Multi Keyword Ranked Search Using Greedy Best First Search

Secure and Dynamic Multi-keyword Ranked Search Scheme and Fuzzy Search over Encrypted Cloud Data

With the increased rate of growth and adaptation of cloud computing, daily, more and more sensitive information is being centralized onto the cloud. For the protection of valuable proprietary information, the data must be encrypted before outsourcing. There is no tolerance for typos and format inconsistencies which are normal user behavior. This makes effective data storage and utilization a ve...

Adding Exploration to Greedy Best-First Search

While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause the algorithm to get stuck performing a lot of unnecessary work. In this report, we consider simple ...

Understanding the Search Behaviour of Greedy Best-First Search

A classical result in optimal search shows that A* with an admissible and consistent heuristic expands every state whose f -value is below the optimal solution cost and no state whose f -value is above the optimal solution cost. For satisficing search algorithms, a similarly clear understanding is currently lacking. We examine the search behaviour of greedy bestfirst search (GBFS) in order to m...

Adaptive Multi-keyword Ranked Search Over Encrypted Cloud Data

P-RANK: Efficient Ranked Keyword Search Using P-tree

Nowadays, XML is becoming the standard for electronic information representation and exchange in our lives. Access to information presented in hyperlinked XML documents and other formats have always been in demand by users. In this paper, we describe the architecture, implementation, and evaluation of the P-RANK system built to address the requirement for efficient ranked keyword search over hy...